Papers by Avishek Joey Bose
A Cross-Domain Transferable Neural Coherence Model (P19-1)
Copied to clipboard
Peng Xu, Hamidreza Saghir, Jin Sung Kang, Teng Long, Avishek Joey Bose, Yanshuai Cao, Jackie Chi Kit Cheung
| Challenge: | Existing coherence models do not generalize to unseen categories of text . previous work advocates for generative models for cross-domain generalization . |
| Approach: | They propose a local discriminative neural model with a smaller negative sampling space that can discriminate against incorrect orderings. |
| Outcome: | The proposed model outperforms state-of-the-art methods on a standard benchmark dataset on the Wall Street Journal corpus and multiple challenging settings on Wikipedia articles. |
Adversarial Contrastive Estimation (P18-1)
Copied to clipboard
| Challenge: | Noise contrastive estimation (NCE) is a general strategy used in word embeddings and translations for knowledge graphs. |
| Approach: | They propose to augment negative sampler into mixture distribution with adversarially learned sampler and to combine it with noise contrastive estimation (NCE) they observe faster convergence and improved results on multiple metrics. |
| Outcome: | The proposed model performs better on word embeddings, order embedds and knowledge graph embeddments and faster convergence and improved results on multiple metrics. |
Neural Path Hunter: Reducing Hallucination in Dialogue Systems via Path Grounding (2021.emnlp-main)
Copied to clipboard
| Challenge: | Dialogue systems that generate factually incorrect responses are often unfitful and hallucinate factuality invalid. |
| Approach: | They propose a method to improve faithfulness and reduce hallucination of neural dialogue systems to known facts supplied by a Knowledge Graph. |
| Outcome: | The proposed approach improves faithfulness and reduces hallucination of dialogue systems to known facts . it leverages a token-level fact critic to identify plausible sources of hallucinism . |
Structure Aware Negative Sampling in Knowledge Graphs (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for learning low-dimensional representations of entities and relations in knowledge graphs employing corruption distributions that generate hard negative samples. |
| Approach: | They propose a structure-aware negative sampling strategy that utilizes the rich graph structure by selecting negative samples from a node’s k-hop neighborhood. |
| Outcome: | The proposed method finds semantically meaningful negatives and is competitive with SOTA approaches while requires no additional parameters nor difficult adversarial optimization. |